Eulerian detachments with local edge-connectivity
نویسندگان
چکیده
منابع مشابه
Eulerian detachments with local edge-connectivity
For a graph G, a detachment operation at a vertex transforms the graph into a new graph by splitting the vertex into several vertices in such a way that the original graph can be obtained by contracting all the split vertices into a single vertex. A graph obtained from a given graph G by applying detachment operations at several vertices is called a detachment of graph G. We consider a detachme...
متن کاملDetachments Preserving Local Edge-Connectivity of Graphs
Let G = (V + s,E) be a graph and let S = (d1, ..., dp) be a set of positive integers with ∑ dj = d(s). An S-detachment splits s into a set of p independent vertices s1, ..., sp with d(sj) = dj , 1 ≤ j ≤ p. Given a requirement function r(u, v) on pairs of vertices of V , an S-detachment is called r-admissible if the detached graph G satisfies λG′(x, y) ≥ r(x, y) for every pair x, y ∈ V . Here λH...
متن کاملLocal Flow Partitioning for Faster Edge Connectivity
We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic O(m log n log log n) time algorithm. This improves both on the best previously known deterministic running time of O(m log n) (Kawarabayashi and Thorup [12]) and the best previously known randomized running time of O(m log n) (Karger [11]) for this problem, though Karger’s algorithm can be fur...
متن کاملEdge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) preserves the local edge-connectivity (the maximum number of pairwise edge disjoint paths) between each pair of vertices in V. The operation splitting off is very useful in graph theory, it is especially powerful in the s...
متن کاملA Brooks Type Theorem for the Maximum Local Edge Connectivity
For a graph G, let χ(G) and λ(G) denote the chromatic number of G and the maximum local edge connectivity of G, respectively. A result of Dirac implies that every graph G satisfies χ(G) 6 λ(G) + 1. In this paper we characterize the graphs G for which χ(G) = λ(G) + 1. The case λ(G) = 3 was already solved by Aboulker, Brettell, Havet, Marx, and Trotignon. We show that a graph G with λ(G) = k > 4 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.08.001